Differential-Algebraic Equations of Index 1 May Have an Arbitrarily High Structural Index
نویسندگان
چکیده
It is shown that the structural index of a linear differential–algebraic equation (DAE) with constant coefficients and with index 1 may be arbitrarily high, contrary to a previous result from the literature. This demonstrates that Pantelides’ algorithm applied to DAEs of index 1 may perform an arbitrarily high number of iterations and differentiations.
منابع مشابه
Polynomial Cost for Solving IVP for High-Index DAE
We show that the cost of solving initial value problems for high-index differential algebraic equations is polynomial in the number of digits of accuracy requested. The algorithm analysed is built on a Taylor series method developed by Pryce for solving a general class of differential algebraic equations. The problem may be fully implicit, of arbitrarily high fixed index and contain derivatives...
متن کاملNumerical solution of higher index DAEs using their IAE's structure: Trajectory-prescribed path control problem and simple pendulum
In this paper, we solve higher index differential algebraic equations (DAEs) by transforming them into integral algebraic equations (IAEs). We apply collocation methods on continuous piece-wise polynomials space to solve the obtained higher index IAEs. The efficiency of the given method is improved by using a recursive formula for computing the integral part. Finally, we apply the obtained algo...
متن کاملThe Sine-Cosine Wavelet and Its Application in the Optimal Control of Nonlinear Systems with Constraint
In this paper, an optimal control of quadratic performance index with nonlinear constrained is presented. The sine-cosine wavelet operational matrix of integration and product matrix are introduced and applied to reduce nonlinear differential equations to the nonlinear algebraic equations. Then, the Newton-Raphson method is used for solving these sets of algebraic equations. To present ability ...
متن کاملStructural index reduction algorithms for differential algebraic equations via fixed-point iteration
Abstract Motivated by Pryce’s structural index reduction method for differential algebraic equations (DAEs), we give a complete theoretical analysis about existence and uniqueness of the optimal solution of index reduction problem, and then show the termination and complexity of the fixed-point iteration algorithm. Based on block upper triangular structure of system, we propose the block fixed-...
متن کاملSubstitute Equations for Index Reduction and Discontinuity Handling
Several techniques exist for index reduction and consistent initialization of higher index DAEs. Many such techniques change the original set of equations by differentiation, substitution, and/or introduction of new variables. This paper introduces substitute equations as a new language element. By means of a substitute equation, the value of a continuous variable or its time derivative can be ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 21 شماره
صفحات -
تاریخ انتشار 2000